Size- and state-aware dispatching problem with queue-specific job sizes
نویسندگان
چکیده
منابع مشابه
Size- and state-aware dispatching problem with queue-specific job sizes
We consider the dispatching problem in a sizeand state-aware multi-queue system with Poisson arrivals and queue-specific job sizes. By sizeand state-awareness, we mean that the dispatcher knows the size of an arriving job and the remaining service times of the jobs in each queue. By queue-specific job sizes, we mean that the time to process a job may depend on the chosen server. We focus on min...
متن کاملOptimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
We consider a cluster of heterogeneous servers, modeled as M/G/1 queues with different processing speeds. The scheduling policies for these servers can be either processor-sharing or first-come first-serve. Furthermore, a dispatcher that assigns jobs to the servers takes as input only the size of the arriving job and the overall job-size distribution. This general model captures the behavior of...
متن کاملMinimizing Slowdown in Heterogeneous Size-Aware Dispatching Systems (full version)
We consider a system of parallel queues where tasks are assigned (dispatched) to one of the available servers upon arrival. The dispatching decision is based on the full state information, i.e., on the sizes of the new and existing jobs. We are interested in minimizing the so-called mean slowdown criterion corresponding to the mean of the sojourn time divided by the processing time. Assuming no...
متن کاملSecond Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملM/M/1-PS queue and size-aware task assignment
We consider a distributed server system in which heterogeneous servers operate under the processor sharing (PS) discipline. Exponentially distributed jobs arrive to a dispatcher, which assigns each task to one of the servers. In the so-called size-aware system, the dispatcher is assumed to know the remaining service requirements of some or all of the existing jobs in each server. The aim is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2012
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.09.029